Evolving monte-carlo tree search algorithms,” Dept

Abstract Monte-Carlo tree search is a recent and powerful algorithm that has been applied with success to the game of Go. Combining it with heuristics for the early development of nodes with few samples makes it even stronger. We use Genetic Programming to evolve such heuristics. The heuristics dis-covered by Genetic Programming outperform UCT and RAVE. Our Genetic Programming system computes the fitness using a Swiss tournament, and it selects valid individuals